Context and Caterpillars and Structured Documents
نویسندگان
چکیده
We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are applying this technique in the speciication of context-dependent style sheets for HTML, XML, and SGML documents, it is clear that it can be used in other environments such as query speciication for structured documents and for computer program transformations. In addition, we present a number of theoretical results that allow us to compare the expressive power of caterpillar expressions to that of tree automata.
منابع مشابه
Caterpillars: A Context Specification Technique
We present a novel, yet simple, technique for the speciication of context in structured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciica-tion for structured documents, as we shall demonstrate, and for the speciication of ...
متن کاملCaterpillars, context, tree automata and tree pattern matching
We present a novel, yet simple, technique for the speciication of context in struc-tured documents that we call caterpillar expressions. Although we are primarily applying this technique in the speciication of context-dependent style sheets for HTML, SGML and XML documents, it can also be used for query speciication for structured documents, as we shall demonstrate, and for the speciication of ...
متن کاملSnakes and Caterpillars in Graceful Graphs
Graceful labelings use a prominent place among difference vertex labelings. In this work we present new families of graceful graphs all of them obtained applying a general substitution result. This substitution is applied here to replace some paths with some trees with a more complex structures. Two caterpillars with the same size are said to be textit{analogous} if thelarger stable sets, in bo...
متن کاملConstructing Graceful Graphs with Caterpillars
A graceful labeling of a graph G of size n is an injective assignment of integers from {0, 1,..., n} to the vertices of G, such that when each edge of G has assigned a weight, given by the absolute dierence of the labels of its end vertices, the set of weights is {1, 2,..., n}. If a graceful labeling f of a bipartite graph G assigns the smaller labels to one of the two stable sets of G, then f ...
متن کاملGraph Technology for Structured Documents
In the context of integrated software engineering environments, graphs and transformations on them have proven to be a useful technology for describing the structure of and operations on documents in formal languages. We discuss ways of applying this graph technology to more general structured documents. Existing editing environments for general structured documents offer only basic structure-o...
متن کامل